Steven Ramsay & Co. to John Kean, January 17, 1789

Steven Ramsay & Co. wrote from Charleston to John Kean, addressed to Beaufort, SC. They sent him his order via Captain Satters. Everything was sent except the magnesia and the wine. They did not have any common bark so they sent him red bark which was better.https://digitalcommons.kean.edu/lhc_1780s/1244/thumbnail.jp

A Guide for Homeland Security Instructors Preparing Physical Critical Infrastructure Protection Courses

Over 350 academic programs in the United States currently offer instruction in the field of homeland defense and security. In spite of this growth at the program level over the past ten years, there still exists a shortage of instructors and coursework in critical infrastructure protection (CIP). Traditional instructor preparation (which is accomplished through the attainment of an advanced degree coupled with research and professional experience) does not currently produce enough instructors qualified in CIP because of the extremely limited number of CIP-related educational opportunities. Therefore, an alternate venue for instructor preparation must be provided. This article addresses that need by providing a guide for educators who desire to engage in a deliberate self-study program to develop sufficient expertise to teach a first course in physical CIP at the undergraduate or master’s degree level. This information is also useful for professionals who have had to assume CIP-related duties and functions without the benefit of supporting coursework. This article introduces a five-part framework for understanding CIP — policy, networks, level of hazard, level of protection, and system design — and provides resources for understanding each part of the framework. Each element of the framework is introduced and briefly explained and then resources are presented which will allow the reader to explore this particular topic in detail. Where possible, resources are presented as Web links to allow the reader to directly access the learning resource, free of charge. The article concludes with guidance for adapting the five-part framework and the materials presented in designing a CIP course tailored to the needs of a specific instructor and institution

A Guide for Homeland Security Instructors Preparing Physical Critical Infrastructure Protection Courses

Over 350 academic programs in the United States currently offer instruction in the field of homeland defense and security. In spite of this growth at the program level over the past ten years, there still exists a shortage of instructors and coursework in critical infrastructure protection (CIP). Traditional instructor preparation (which is accomplished through the attainment of an advanced degree coupled with research and professional experience) does not currently produce enough instructors qualified in CIP because of the extremely limited number of CIP-related educational opportunities. Therefore, an alternate venue for instructor preparation must be provided. This article addresses that need by providing a guide for educators who desire to engage in a deliberate self-study program to develop sufficient expertise to teach a first course in physical CIP at the undergraduate or master’s degree level. This information is also useful for professionals who have had to assume CIP-related duties and functions without the benefit of supporting coursework. This article introduces a five-part framework for understanding CIP — policy, networks, level of hazard, level of protection, and system design — and provides resources for understanding each part of the framework. Each element of the framework is introduced and briefly explained and then resources are presented which will allow the reader to explore this particular topic in detail. Where possible, resources are presented as Web links to allow the reader to directly access the learning resource, free of charge. The article concludes with guidance for adapting the five-part framework and the materials presented in designing a CIP course tailored to the needs of a specific instructor and institution

Effects and Effect Handlers for Programmable Inference

Inference algorithms for probabilistic programming are complex imperative programs with many moving parts. Efficient inference often requires customising an algorithm to a particular probabilistic model or problem, sometimes called inference programming. Most inference frameworks are implemented in languages that lack a disciplined approach to side effects, which can result in monolithic implementations where the structure of the algorithms is obscured and inference programming is hard. Functional programming with typed effects offers a more structured and modular foundation for programmable inference, with monad transformers being the primary structuring mechanism explored to date. This paper presents an alternative approach to programmable inference, based on algebraic effects, building on recent work that used algebraic effects to represent probabilistic models. Using effect signatures to specify the key operations of the algorithms, and effect handlers to modularly interpret those operations for specific variants, we develop three abstract algorithms, or inference patterns, representing three important classes of inference: Metropolis-Hastings, particle filtering, and guided optimisation. We show how our approach reveals the algorithms' high-level structure, and makes it easy to tailor and recombine their parts into new variants. We implement the three inference patterns as a Haskell library, and discuss the pros and cons of algebraic effects vis-a-vis monad transformers as a structuring mechanism for modular imperative algorithm design. It should be possible to reimplement our library in any typed functional language able to emulate effects and effect handlers

Initial Limit Datalog:a new extensible class of decidable constrained Horn clauses

We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types) of the first-order language limit Datalog Z (a fragment of Datalog modulo linear integer arithmetic), but can be instantiated with any suitable background theory. For example, the fragment is decidable over any countable well-quasi-order with a decidable first-order theory, such as natural number vectors under componentwise linear arithmetic, and words of a bounded, context-free language ordered by the subword relation. Formulas of initial limit Datalog have the property that, under some assumptions on the background theory, their satisfiability can be witnessed by a new kind of term model which we call entwined structures. Whilst the set of all models is typically uncountable, the set of all entwined structures is recursively enumerable, and model checking is decidable